Nearest southeast submatrix that makes multiple a prescribed eigenvalue. Part 1
نویسندگان
چکیده
منابع مشابه
Computational aspect to the nearest southeast submatrix that makes multiple a prescribed eigenvalue
Given four complex matrices $A$, $B$, $C$ and $D$ where $Ainmathbb{C}^{ntimes n}$ and $Dinmathbb{C}^{mtimes m}$ and let the matrix $left(begin{array}{cc} A & B C & D end{array} right)$ be a normal matrix and assume that $lambda$ is a given complex number that is not eigenvalue of matrix $A$. We present a method to calculate the distance norm (with respect to 2-norm) from $D$ to ...
متن کاملcomputational aspect to the nearest southeast submatrix that makes multiple a prescribed eigenvalue
given four complex matrices a, b, c and d where a 2 cnn and d 2 cmm andlet the matrix(a bc d)be a normal matrix and assume that is a given complex number that is not eigenvalue of matrix a. we present a method to calculate the distance norm (with respect to 2-norm) from d to the set of matrices x 2 cmm such that, be a multiple eigenvalue of matrix(a bc x). we also nd the nearest matrix ...
متن کاملGraphs with prescribed star complement for the eigenvalue 1
Let G be a graph of order n and let μ be an eigenvalue of multiplicity m. A star complement for μ in G is an induced subgraph of G of order n−m with no eigenvalue μ. In this paper, we study the maximal graphs as well as regular graphs which have Kr,s + tK1 as a star complement for eigenvalue 1. It turns out that some well known strongly regular graphs are uniquely determined by such a star comp...
متن کاملThe distance from a matrix polynomial to matrix polynomials with a prescribed multiple eigenvalue
For a matrix polynomial P (λ) and a given complex number μ, we introduce a (spectral norm) distance from P (λ) to the matrix polynomials that have μ as an eigenvalue of geometric multiplicity at least κ, and a distance from P (λ) to the matrix polynomials that have μ as a multiple eigenvalue. Then we compute the first distance and obtain bounds for the second one, constructing associated pertur...
متن کاملComputing the Nearest Doubly Stochastic Matrix with A Prescribed Entry
In this paper a nearest doubly stochastic matrix problem is studied. This problem is to find the closest doubly stochastic matrix with the prescribed (1, 1) entry to a given matrix. According to the well-established dual theory in optimization, the dual of the underlying problem is an unconstrained differentiable but not twice differentiable convex optimization problem. A Newton-type method is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2009
ISSN: 0024-3795
DOI: 10.1016/j.laa.2008.10.012